MUSer2: An Efficient MUS Extractor

نویسندگان

  • Anton Belov
  • Joao Marques-Silva
چکیده

Algorithms for extraction of Minimally Unsatisfiable Subformulas (MUSes) of CNF formulas find a wide range of practical applications, including product configuration, knowledgebased validation, hardware and software design and verification. This paper describes the MUS extractor MUSer2. MUSer2 implements a wide range of MUS extraction algorithms, integrates a number of key optimization techniques, and represents the current state-ofthe-art in MUS extraction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel MUS Extraction

Parallelization is a natural direction towards the improvements in the scalability of algorithms for the computation of Minimally Unsatisfiable Subformulas (MUSes), and group-MUSes, of CNF formulas. In this paper we propose and analyze a number of approaches to parallel MUS computation. Just as it is the case with the parallel CDCL-based SAT solving, the communication, i.e. the exchange of lear...

متن کامل

MUS Extraction Using Clausal Proofs

Recent work introduced an effective method for extraction of reduced unsatisfiable cores of CNF formulas as a by-product of validation of clausal proofs emitted by conflict-driven clause learning SAT solvers. In this paper, we demonstrate that this method for trimming CNF formulas can also benefit state-of-the-art tools for the computation of a Minimal Unsatisfiable Subformula (MUS). Furthermor...

متن کامل

Factoring Out Assumptions to Speed Up MUS Extraction

In earlier work on a limited form of extended resolution for CDCL based SAT solving, new literals were introduced to factor out parts of learned clauses. The main goal was to shorten clauses, reduce proof size and memory usage and thus speed up propagation and conflict analysis. Even though some reduction was achieved, the effectiveness of this technique was rather modest for generic SAT solvin...

متن کامل

Nahla A Belal An Efficient Rank Based Arabic Root Extractor

Nahla A Belal An Efficient Rank Based Arabic Root Extractor A morphologically-rich language such as Arabic requires deep analysis this is due to its invaluable characteristics which are beneficial for the task of root extraction. This paper investigates employing new techniques to enumerate and rank possible roots for a given word, using linguistic rules as scoring mechanisms. The proposed tech...

متن کامل

An Efficient Patent Keyword Extractor As Translation Resource

The paper addresses the issue of resource reuse in patent translation. It presents an efficient patent keyword/phrase extraction tool and illustrates how the tool can be used in patent translation by both human experts and MT developers. The keyword extraction is based on a new hybrid methodology providing for intelligent output and computationally attractive properties. The tool is composed of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSAT

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2012